Strong Approximations for Multi lass Feedforward Queueing Networks
نویسندگان
چکیده
منابع مشابه
Robust Transient Multi-Server Queues and Feedforward Networks
We propose an analytically tractable approach for studying the transient behavior of multi-server queueing systems and feedforward networks with deterministic routing. We model the queueing primitives via polyhedral uncertainty sets inspired by the limit laws of probability. These uncertainty sets are characterized by parameters that control the degree of conservatism of the model. Assuming the...
متن کاملStochastic Analysis via Robust Optimization
To evaluate the performance and optimize systems under uncertainty, two main avenues have been suggested in the literature: stochastic analysis and optimization describing the uncertainty probabilistically and robust optimization describing the uncertainty deterministically. Instead, we propose a novel paradigm which leverages the conclusions of probability theory and the tractability of the ro...
متن کاملMarkov-modulated Feedforward Fluid Networks
With the aim of studying a multi-station feedforward uid network with Markov modulated input and output rates we rst study a two dimensional parallel network having the property that the second station cannot be empty unless the rst station is. A method for computing the steady state characteristics of such a process is given and it is shown that this can be used to determine the steady state c...
متن کاملOptimal Routing in General Finite Multi-Server Queueing Networks
The design of general finite multi-server queueing networks is a challenging problem that arises in many real-life situations, including computer networks, manufacturing systems, and telecommunication networks. In this paper, we examine the optimal routing problem in arbitrary configured acyclic queueing networks. The performance of the finite queueing network is evaluated with a known approxim...
متن کاملTowards Better Multi-class Parametric-decomposition Approximations for Open Queueing Networks
Methods are developed for approximately characterizing the departure process of each customer class from a multi-class single-server queue with unlimited waiting space and the firstin first-out service discipline. The model is Σ(GI i / GI i )/1 with a non-Poisson renewal arrival process and a non-exponential service-time distribution for each class. The methods provide a basis for improving par...
متن کامل